RNC Algorithms for theUniform Generation of Combinatorial
نویسندگان
چکیده
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unla-belled undirected graphs are generated in O(lg 3 n) time using O "n 2 lg 3 n processors if their number is known in advance and in O(lg n) time using O "n 2 lg n processors otherwise. In both cases the error probability is the inverse of a polynomial in ". Thus " may be chosen to trade-oo processors for error probability. Also, for an arbitrary graph, we describe RNC algorithms for the uniform generation of its subgraphs that are either non-simple paths or spanning trees. The work measure for the subgraph algorithms is essentially determined by the transitive closure bottleneck. As for sequential algorithms, the general notion of constructing generators from counters also applies to parallel algorithms although this approach is not employed by all the algorithms of this paper.
منابع مشابه
RNC Algorithms for the Uniform Generation of Combinatorial Structures
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg n) time us-
متن کاملPerformance Evaluation of Channel Switching Scheme for Packet Data Transmission in Radio Network Controller
W-CDMA (Wideband-CDMA) is expected to play a significant role in the radio access technology of third-generation mobile telecommunication systems. In second-generation systems, voice traffic from each user has been transmitted mainly via the dedicated transport (radio) channel. In addition, the third-generation systems will efficiently accommodate data traffic based on packet transmission in th...
متن کاملProfiles of covering arrays of strength two
Covering arrays of strength two have been widely studied as combinatorial models of software interaction test suites for pairwise testing. While numerous algorithmic techniques have been developed for the generation of covering arrays with few columns (factors), the construction of covering arrays with many factors and few tests by these techniques is problematic. Random generation techniques c...
متن کاملRNC-Approximation Algorithms for the Steiner Problem
In this paper we present an RNC-algorithm for nding a minimum spanning tree in a weighted 3-uniform hypergraph, assuming the edge weights are given in unary, and a fully polynomial time randomized approximation scheme if the edge weights are given in binary. From this result we then derive RNC-approximation algorithms for the Steiner problem in networks with approximation ratio (1 +) 5=3 for al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007